Zero-One Law for Connectivity in Superposition of Random Key Graphs on Random Geometric Graphs
نویسندگان
چکیده
منابع مشابه
On the zero-one law for connectivity in one-dimensional geometric random graphs
We consider the geometric random graph where n points are distributed uniformly and independently on the unit interval [0, 1]. Using the method of first and second moments, we provide a simple proof of the “zero-one” law for the property of graph connectivity under the asymptotic regime created by having n become large and the transmission range scaled appropriately with n.
متن کاملZero-One Laws for Connectivity in Random Key Graphs
The random key graph is a random graph naturally associated with the random key predistribution scheme introduced by Eschenauer and Gligor in the context of wireless sensor networks. For this class of random graphs we establish a new version of a conjectured zero-one law for graph connectivity as the number of nodes becomes unboundedly large. The results reported here complement and strengthen ...
متن کاملOn Connectivity Thresholds in the Intersection of Random Key Graphs on Random Geometric Graphs
Abstract—In a random key graph (RKG) of n nodes each node is randomly assigned a key ring of Kn cryptographic keys from a pool of Pn keys. Two nodes can communicate directly if they have at least one common key in their key rings. We assume that the n nodes are distributed uniformly in [0, 1]. In addition to the common key requirement, we require two nodes to also be within rn of each other to ...
متن کاملA zero-one law for k-connectivity in Random K-out graphs intersecting Erdős-Rényi Graphs
We investigate k-connectivity in secure wireless sensor networks under the random pairwise key predistribution scheme with unreliable links; a network is said to be kconnected if it remains connected despite the failure of any of its (k − 1) nodes or links. With wireless communication links modeled as independent on-off channels, this amounts to analyzing a random graph model formed by intersec...
متن کاملA strong zero-one law for connectivity in one-dimensional geometric random graphs with non-vanishing densities
We consider the geometric random graph where n points are distributed independently on the unit interval [0, 1] according to some probability distribution function F . Two nodes communicate with each other if their distance is less than some transmission range. When F admits a continuous density f which is strictly positive on [0, 1], we show that the property of graph connectivity exhibits a s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Dynamics in Nature and Society
سال: 2015
ISSN: 1026-0226,1607-887X
DOI: 10.1155/2015/982094